On Abelian and Additive Complexity in Infinite Words
نویسندگان
چکیده
The study of the structure of infinite words having bounded abelian complexity was initiated by G. Richomme, K. Saari, and L. Q. Zamboni. In this note we define bounded additive complexity for infinite words over a finite subset of Zm. We provide an alternative proof of one of the results of the aforementioned authors.
منابع مشابه
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity
The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden’s theorem, they proved that if a word avoids Abelian k-powers for some integer k, then its Abelian complexity is unbounded. This suggests the following question: How frequently do Abelian k-powers occur in a word ...
متن کاملOn some generalizations of abelian power avoidability
We prove that 2-abelian-cubes are avoidable over a binary alphabet and that 3-abelian-squares are avoidable over a ternary alphabet, answering positively to two questions of Karhumäki et al.. We also show the existence of infinite additive-cube-free words on several ternary alphabets. To achieve this, we give sufficient conditions for a morphism to be k-abelian-n-power-free (resp. additive-n-po...
متن کاملOn a generalization of Abelian equivalence and complexity of infinite words
In this paper we introduce and study a family of complexity functions of infinite words indexed by k ∈ Z+ ∪ {+∞}. Let k ∈ Z+ ∪ {+∞} and A be a finite non-empty set. Two finite words u and v in A are said to be k-Abelian equivalent if for all x ∈ A of length less than or equal to k, the number of occurrences of x in u is equal to the number of occurrences of x in v. This defines a family of equi...
متن کاملAbelian complexity of infinite words associated with quadratic Parry numbers
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers. © 2011 Elsevier B.V. All rights reserved.
متن کاملVariations of the Morse-Hedlund Theorem for k-Abelian Equivalence
In this paper we investigate local-to-global phenomena for a new family of complexity functions of infinite words indexed by k ∈ N1∪{+∞} where N1 denotes the set of positive integers. Two finite words u and v in A∗ are said to be k-abelian equivalent if for all x ∈ A∗ of length less than or equal to k, the number of occurrences of x in u is equal to the number of occurrences of x in v. This def...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012